By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 18, Issue 6, pp. 1057-1283

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Analysis of Preflow Push Algorithms for Maximum Network Flow

J. Cheriyan and S. N. Maheshwari

pp. 1057-1086

Polynomial Space Counting Problems

Richard E. Ladner

pp. 1087-1097

Scheduling Arithmetic and Load Operations in Parallel with No Spilling

David Bernstein, Jeffrey M. Jaffe, and Michael Rodeh

pp. 1098-1127

Computing Simple Circuits from a Set of Line Segments is NP-Complete

David Rappaport

pp. 1128-1139

The Two-Processor Scheduling Problem is in Random NC

Umesh V. Vazirani and Vijay V. Vazirani

pp. 1140-1148

Approximating the Permanent

Mark Jerrum and Alistair Sinclair

pp. 1149-1178

A Correction Network for $N$-Sorters

Schimmler Manfred and Christoph Starke

pp. 1179-1187

Solution of a Divide-and-Conquer Maximin Recurrence

Zhiyuan Li and Edward M. Reingold

pp. 1188-1200

Geometry Helps in Matching

Pravin M. Vaidya

pp. 1201-1225

On Relaxed Squashed Embedding of Graphs into a Hypercube

Ming-Syan Chen and Kang G. Shin

pp. 1226-1244

Simple Fast Algorithms for the Editing Distance between Trees and Related Problems

Kaizhong Zhang and Dennis Shasha

pp. 1245-1262

Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation

Bala Ravikumar and Oscar H. Ibarra

pp. 1263-1282

Erratum: Two Applications of Indctive Counting for Complementation Problems

Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, and Martin Tompa

p. 1283